Simplicial complex

Results: 124



#Item
51CCCG 2004, Montreal, Quebec, August 9–11, 2004  Using Bistellar Flips for Rotations in Point Location Structures 

CCCG 2004, Montreal, Quebec, August 9–11, 2004 Using Bistellar Flips for Rotations in Point Location Structures 

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
5216th Canadian Conference on Computational Geometry, 2004  Simplicial Depth: An Improved Definition, Analysis, and Efficiency for the Finite Sample Case Michael A. Burr

16th Canadian Conference on Computational Geometry, 2004 Simplicial Depth: An Improved Definition, Analysis, and Efficiency for the Finite Sample Case Michael A. Burr

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
53Graph-theoretic methods in combinatorial (algebraic) topology Michal Adamaszek Universit¨ at Bremen

Graph-theoretic methods in combinatorial (algebraic) topology Michal Adamaszek Universit¨ at Bremen

Add to Reading List

Source URL: projects.au.dk

Language: English - Date: 2013-04-29 03:32:40
54Topology Preserving Graph Matching Jeffrey Byrne Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 {jebyrne}@cis.upenn.edu

Topology Preserving Graph Matching Jeffrey Byrne Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 {jebyrne}@cis.upenn.edu

Add to Reading List

Source URL: www.jeffreybyrne.com

Language: English - Date: 2013-05-01 13:34:08
55ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2014-10-30 10:03:20
56Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2011-06-02 03:40:55
57Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Relaxed vertex colorings of simplicial complexes Natalia Dobrinskaya1 Jesper M. Møller2 Notbohm1

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2011-11-04 06:42:35
58Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP)

Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP)

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2015-03-23 03:34:03
59VERTEX COLORINGS OF SIMPLICIAL COMPLEXES NATALIA DOBRINSKAYA, JESPER M. MØLLER, AND DIETRICH NOTBOHM Contents 1. Introduction 1.1. Notation and the basic definition

VERTEX COLORINGS OF SIMPLICIAL COMPLEXES NATALIA DOBRINSKAYA, JESPER M. MØLLER, AND DIETRICH NOTBOHM Contents 1. Introduction 1.1. Notation and the basic definition

Add to Reading List

Source URL: www.math.ku.dk

Language: English - Date: 2010-07-05 04:18:21
60Vietoris-Rips complexes of circular points Michal Adamaszek Max Planck Institute for Informatics, Saarbr¨ ucken  Joint work-in-progress with

Vietoris-Rips complexes of circular points Michal Adamaszek Max Planck Institute for Informatics, Saarbr¨ ucken Joint work-in-progress with

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2015-03-23 03:34:01